import TreeNode from "../MyClass/Tree.js"; //  构造函数
import {root} from "../MyClass/Tree.js";   // 一棵构建好的树
import {
    preOrder,   //前序遍历
    inOrder,    //中序遍历
    postOrder,  //后序遍历
    levelOrder, //层序遍历
    preOrderList,
    inOrderList,
    postOrderList,
    levelOrderList,
    buildTreeByPostOrderListAndInOrderList,
    buildTreeByPreOrderListAndInOrderList
} from "../MyClass/Tree.js"

import {depthFirstSearch as DFS,breadthFirstSearch as BFS} from "../MyClass/Tree.js";
import {CompareTree,StrictCompareTree} from "../MyClass/Tree.js";
import {treeDiff} from "../MyClass/Tree.js"

// 创建第二层节点
/** @type {TreeNode} */
const root1 = new TreeNode("A");
root1.left = new TreeNode("B");
root1.right = new TreeNode("C");

// 创建第三层节点
root1.left.left = new TreeNode("D");
root1.left.right = new TreeNode("E");
root1.right.left = new TreeNode("F");
// root1.right.right = new TreeNode("G");

// 创建第四层节点
root1.left.left.left = new TreeNode("H");
root1.left.left.right = new TreeNode("J");
root1.left.left.left.right = new TreeNode("K");
console.log(treeDiff(root,root1,[]));


